Streaming Algorithms for Line Simplification
نویسندگان
چکیده
منابع مشابه
Streaming Algorithms for Line Simplification under the Fréchet Distance
We study the following variant of the well-known linesimplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . defining a polygonal path, and as we receive the points we wish to maintain a simplification of the path seen so far. We study this problem in a streaming setting, where we only have a limited amount of storage so that we cannot store all the point...
متن کاملLine Simplification Algorithms
Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms for a variety of generalisation operations, including line simplification. A major objective when capturing linear digital map data is the creation of accurate representation of naturally occurring lines, using a minimum of processing tim...
متن کاملLine Simplification Algorithms
for the talk on Abstract We will give an overview of different methods for polyline simplification. Different algorithms will be presented. Special emphasis will be given to the
متن کاملImplementing Streaming Simplification for large Labeled Meshes
Data capture technologies like airborne LIDAR produce extremely large models of digital terrain, which must be simplified to be useful. Garland and Heckbert’s quadric error metric in conjunction with edge contraction gives a greedy approach to simplify a mesh that can fit in memory; we adapt it to work with boundaries and labels (e.g., object ID, ground vs. building, or some discrimination betw...
متن کاملStreaming Simplification of Tetrahedral Meshes
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2009
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9132-4